Probabilistic Recursion Theory and Implicit Computational Complexity
نویسندگان
چکیده
منابع مشابه
Probabilistic Recursion Theory and Implicit Computational Complexity
In this thesis we provide a characterization of probabilistic computation in itself, from a recursion-theoretical perspective, without reducing it to deterministic computation. More specifically, we show that probabilistic computable functions, i.e., those functions which are computed by Probabilistic Turing Machines (PTM), can be characterized by a natural generalization of Kleene’s partial re...
متن کاملProbabilistic Recursion Theory and Implicit Computational Complexity (Long Version)
We show that probabilistic computable functions, i.e., those functions outputting distributions and computed by probabilistic Turing machines, can be characterized by a natural generalization of Church and Kleene’s partial recursive functions. The obtained algebra, following Leivant, can be restricted so as to capture the notion of polytime sampleable distributions, a key concept in average-cas...
متن کاملQuantum implicit computational complexity
We introduce a quantum lambda calculus inspired by Lafont’s Soft Linear Logic and capturing the polynomial quantum complexity classes EQP, BQP and ZQP. The calculus is based on the ‘‘classical control and quantum data’’ paradigm. This is the first example of a formal systemcapturing quantumcomplexity classes in the spirit of implicit computational complexity — it is machine-free and no explicit...
متن کاملResource analysis and implicit computational complexity
Implicit computational complexity (ICC) studies machine-independent approaches to computational complexity, with emphasis on approaches based on mathematical logic. Most work consists in characterizations of complexity classes by logical systems (via the Curry-Howard correspondence). Unfortunately, all these formal systems have been studied with different, often unrelated methodologies, and few...
متن کاملComputational Complexity of Probabilistic Disambiguation
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various linguistic phenomena of interest, are gathered from actual linguistic data and used to estimate the probabilities of the various entities that are generated by a given grammar, e.g., derivations, parse-trees and sentenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Annals of Computer Science
سال: 2014
ISSN: 2248-2695
DOI: 10.7561/sacs.2014.2.177